Systems and methods for intelligently grouping financial product users into cohesive cohorts

ABSTRACT

Systems and methods are provided that, in some embodiments that extract user data from at least one data warehouse. The user data is sorted within each dimension, and partitions each dimension into bins. Clusters are defined as each bin that includes user data for a number of users that exceeds a threshold. Clusters are determined for every combination of dimensions. Each combination of clusters that exceed the threshold is defined as clusters that are formed from multiple dimensions. All clusters and other clusters are stored into a cluster definition table. The clusters are used to analyze the profile of specific users.

BACKGROUND Field of the Disclosure

Embodiments presented herein generally relate to systems and method forforming clusters and pruning clusters, and more specifically toassociating a specific user with at least one unpruned cluster.

Description of the Related Art

Databases may store data of all sorts. Large databases are sometimesreferred to as data warehouses. A common application for a database isto store data about users of a system. Sometimes this data is organizedinto user profiles, which store various data about users. As the cost ofdigital storage has come down, it has become common to store vastamounts of data about users. Unfortunately, simply storing vast ofamounts of data is often not useful to an organization. Rather, the dataneeds to be analyzed to be useful. Because the quantity of the storeddata is ever increasing, such analysis can be time consuming and canconsume a relatively large amount of computing resources, such asprocessing power, network bandwidth, and memory space.

SUMMARY

Embodiments herein generally relate to forming clusters and pruningnon-relevant clusters, and more specifically to associating a specificuser with at least one relevant cluster.

Some embodiments herein generally relate to a computer-implementedmethod for processing data that includes extracting user data from atleast one data warehouse. The user data is sorted into dimensions, wherethe dimensions are one of categorical values and numerical values. Eachdimension is partitioned into bins. Clusters are defined for each binthat includes user data for a number of users that exceeds a threshold.Clusters are overlaid from every combination of dimensions and eachoverlaid cluster that exceeds the threshold is defined as otherclusters. All clusters and other clusters are stored into a clusterdefinition table.

In another embodiment, a computer-implemented method for processingdata, includes partitioning, into a plurality of bins, user data foreach dimension in a plurality of dimensions. Clusters are defined asbins that include the user data for a number of users above a threshold.Clusters for each dimension are stored into a cluster definitions table.Clusters for every dimension combination are analyzed. Each combinationis partitioned into bins. Bins that include the user data that exceedsthe threshold number of users are defined as clusters. The overlaidclusters are stored in the cluster definitions table.

In yet another embodiment, a computer-implemented method for processingdata, includes searching a cluster definition table having clusters forat least one associated cluster in a highest dimension for associationwith a specific user. The search includes omitting clusters that do notcontain client cluster criteria and user characteristics for thespecific user, and leaving remaining clusters. User characteristics arecompared for the specific user to clusters that are in a dimension thatis equal to a cluster in the highest dimension that contains the usercharacteristics. Decrementing the comparison, of the user specific datadown to a cluster in a next highest dimension and comparing the userspecific data to clusters in the next dimensional, wherein thedecrementing is repeatedly done until the at least one associatedcluster is found.

In another embodiment, a computer-implemented method for processing dataincludes receiving user data, context data, a group of clusters, andstatistics for each cluster in the group of clusters. User data iscompared to the statistics to calculate heuristics for each cluster inthe group of clusters. Clusters are scored based upon at least one ofthe statistics and the user data. A heuristic is selected from thescored clusters. A cluster is selected that is closest to the selectedheuristic.

Other embodiments of this disclosure are provided that include othermethods and systems having features similar to the computer-implementedmethod described herein.

BRIEF DESCRIPTION OF THE DRAWINGS

So that the manner in which the above recited features of the presentdisclosure can be understood in detail, a more particular description ofthe disclosure, briefly summarized above, may be had by reference toembodiments, some of which are illustrated in the appended drawings. Itis to be noted, however, that the appended drawings illustrate onlycertain embodiments of this disclosure and are therefore not to beconsidered limiting of its scope.

FIG. 1 illustrates a computing environment, according to one embodiment.

FIG. 2 illustrates a process for clustering data, according to oneembodiment.

FIG. 3 illustrates a method of processing user data, according to oneembodiment.

FIG. 4 illustrates a method of associating a user with a cluster,according to one embodiment.

FIG. 5 illustrates a method of associating a user with a cluster,according to one embodiment.

FIG. 6 illustrates a method for heuristically associating a user with acluster, according to one embodiment.

FIG. 7 illustrates a method for heuristically selecting a cluster forthe user, according to one embodiment.

FIG. 8 illustrates a computing system for performing clustering andutilizing that clustering, according to one embodiment.

To facilitate understanding, identical reference numerals have beenused, wherever possible, to designate identical elements that are commonto the figures.

DETAILED DESCRIPTION

In the following description, numerous specific details are set forth toprovide a more thorough understanding of the disclosure. As will beapparent to those skilled in the art, however, various changes usingdifferent configurations may be made without departing from the scope ofthe disclosure. Notably, certain details within the knowledge of aperson of skill in the art may be omitted in order to avoid obscuringthe disclosure. Thus, the disclosure is not considered limited to theparticular illustrative embodiments shown in the specification and allsuch alternate embodiments are intended to be included in the scope ofthe appended claims.

Embodiments of systems and methods are disclosed herein for formingclusters from user data; pruning unneeded clusters; and associating aspecific user's profile with the remaining clusters (i.e., after thepruning). Because databases typically hold data for many users and manytypes of data for those users, it can be difficult to get usefulinformation from raw data stored in the databases. It becomes moredifficult when multiple databases are accessed, which each hold data fordifferent users or even different data for the same users. Comparingthis data with data for a specific user can is not only conceptuallychallenging, but it consumes large amounts of computing resources, suchas processing power (e.g., to compare data), network bandwidth (e.g., toaccess data), and storage capacity (e.g., to store data).

In order to make the analysis of data more efficient, and thereby reducethe computing resources necessary to perform the analysis, clusters ofdata may be formed to identify groups of users with commoncharacteristics or attributes. The clusters themselves may beconfigured, for example, to exclude outliers i.e., data that fallsoutside defined thresholds. Because different clusters can havedifferent data dimensions, it is further possible to prune unneededclusters from certain analyses, which further reduces the draw oncomputing resources because less data needs to be examined. Thus,embodiments disclosed herein may improve the performance of devicesperforming data analysis by, for example, reducing a data setsignificantly without significantly reducing the information in thatdata set.

FIG. 1 illustrates an example of a computing environment 100 for formingclusters, pruning clusters, searching for a suitable cluster(s), andassociated a user with a cluster(s), according to one embodiment. Asillustrated, computing environment 100 includes a user device 108, aserver 102, and a data warehouse 106. In some embodiments, components ofone or more of these different devices (e.g., server 102 and datawarehouse 106) may be included within a single device.

The user device 108 may comprise a computing device such as a desktop orlaptop computer, server, mobile phone, tablet computer, or the like.User device 108 contains a user interface 110, which may allow input ofa specific user's profile. In some embodiments, user interface 110 alsoallows a user to view results from an application 116 that has analyzedthe user's profile, statistics, and clusters.

Server 102 may include a computing device such as a rack server, desktopor laptop computer, mobile phone, tablet computer, or the like. Server102 includes an application 118, which may form clusters from data inthe data warehouse 106. In certain embodiments, application 116 mayinclude a web service (e.g., a remotely hosted financial servicesapplication).

Data warehouse 106 may include a data storage entity such as a database(e.g., user data 112 and the cluster definition table 114), repository,distributed storage system, or the like. Data warehouse 106 may includesource code (not shown), which may be the source code for application116 and cluster application 118.

FIG. 2 illustrates an embodiment of a method 200 for clustering userdata, such as user data stored in data warehouse 202. Data warehouse 202is configured to store user data, statistics, personal financial data,credit report data, raw and derived tax data, small business data (e.g.,invoices), self-reported data, usage data (e.g., beacon data indicatingthe user's click stream and interactions in the system), or othernon-financial data.

The user data can include numerical data (e.g., a user's age) and/orcategorical data (e.g., a user's marriage status (e.g., married, single,divorced), address, home ownership status (e.g., own or rent), etc.). Inthe case of categorical data, the data may be mapped to a numericalspace (e.g., a binary response category may be mapped to a ‘1’ and ‘0’in a numerical space). Sometimes the categorical data may be used toform numerical statistics despite being non-numerical data. For example,the number of responses or occurrences of a particular category (e.g.,married) may be used to form a numerical statistic, such as 52% of theusers are married.

Numerical and/or categorical data associated with a user may be storedwithin a user profile that includes a plurality of attributes.

While FIG. 2 depicts a single data warehouse 202 for simplicity, otherembodiment may include a plurality of data warehouses, which may be indata communication with each other over data links, such as networkconnections.

Data from the data warehouse 202 can be extracted and placed in a matrix204, or in some cases stored within data warehouse 202 in such a format.In this example, the matrix 204 includes “N” number of users (shown asindividual rows in FIG. 2) and “D” number of dimensions (i.e.,attributes or characteristics) of user data (shown as individual columnsin FIG. 2). For example, the matrix 204 in FIG. 2 has four users suchthat N=four, and four data dimensions, such that D=four. Otherembodiments may include fewer or more users and/or dimensions. Here, thefour data dimensions for each user are: “AGE,” “INCOME,” “CREDIT SCORE,”and “TOTAL DEBT”.

In the embodiment depicted in FIG. 2, each dimension of the user datafrom data warehouse 202 is placed in a 1-Dimensional plot 206.Illustratively, the 1-Dimensional plot 206 depicts the “CREDIT SCORE”dimension, which is partitioned into eight bins (bins 207 ₁, 207 ₂, 207₃, 207 ₄, 207 ₅, 207 ₆, 207 ₇, and 207 ₈ (collectively “bins 207”)). Thebins each count the number of users falling within the range defined bythe bin and the set of bins collectively count the number of usersfalling within the total range of the dimension. For example, here therange of the dimension “CREDIT SCORE” may be from 0 to 850.

In some embodiments, data dimensions are partitioned so that each binhas the same range in values (e.g., every bin is 10 units wide). Inother embodiments, the bins 207 may have different respective ranges,for example, according to different statistical distributions. Forexample, the bins may be sized to account for, normalize, or otherwiseaffect a known statistical distribution of the underlying data. Thus,data occurring in, for example, a normal distribution may neverthelessbe roughly equally distributed in bins whose ranges account for thedistribution of the underlying data. In yet other embodiments, the bins207 may have dynamic ranges that are adjusted based on one or moreattributes of the underlying user data. For example, if the “CREDITSCORE” data includes only scores between 500 and 800, the bins 207 maybe dynamically adjusted to equally divide the actual range of the data(in this example, 500-800), rather than the possible range of the data(in this example, 0-850). As yet another example, the bins may bedynamically adjusted to account for high or low density groupings withinthe data. For example, when a particular bin exceeds a predeterminednumber of users falling within that bin, the bin may be subdivideddynamically to produce a more granular distribution within thehigh-density data. In some cases, dynamically adjusting bins may be donerecursively until a desired states is reached, e.g., until a number ofusers falling within each bin, or a group of bins, is at a desiredlevel. Dynamically adjusting the number of bins and ranges of bins mayreduce the number of bins that were searched and further improveefficiency.

Threshold values may be set with respect to the number of users fallingwithin bins 207 so as to define clusters of users. For example,1-Dimensional plot 206 includes a substantially horizontal dashed line203 indicating a threshold value (here, a threshold value of four) withrespect to the number of users located in bins 207. In the 1-Dimensionalplot 206, bins 207 ₄ and 207 ₅, exceed the threshold 203 and are thuslabeled as 1-Dimensional clusters and are thereafter stored in a clusterdefinition table 208. The cluster definitions table 208 can be used tosearch and associate a user with a suitable cluster(s); and/or tocompare specific data (e.g., AGE or INCOME) for the user to other usersin the suitable cluster(s). As used herein, “suitable cluster” or “bestcluster” is a cluster with the highest dimensionality (i.e., clusterthat include the highest number of dimensions that are associated with auser).

This process of placing users into data dimension bins based on arespective value associated with the user for that data dimension can berepeated for each data dimension to form multiple 1-Dimensionalclusters. For example, here the same process may be repeated for the“AGE”, “INCOME”, and “TOTAL DEBT” data dimensions, which results in1-Dimensional cluster definitions for each of these data dimensionsbeing stored in cluster definition table 208.

Two or more data dimensions may be compared against each other, e.g.,plotted on orthogonal axes, such as shown in plot 210 with the “AGE” and“INCOME” data dimensions. In this way, clusters that include multipledimensions may be formed (shown as hashed grid squares in FIG. 2) usinga process similar to that of the 1-Dimensional clusters. Here again,clusters may be defined when more than a threshold number of users fallswithin any particular bin, such as a grid square in plot 210. Forexample, with respect to plot 210, when more than a threshold number ofusers fall into a grid square corresponding to a certain age and incomelevel, a new 2-Dimensional cluster may be defined and thereafter storedin cluster definition table 208.

In some embodiments, the data used to form clusters is based on theclusters of a lower dimension. For example, points on plot 210 maycorrespond to 1-Dimensional bins that were found to have clusters (i.e.were found to include a number of users above a threshold) rather thanto individual users' data. In this way, the clusters (e.g. 1-Dimensionalclusters) may be used to define clusters having a higher dimensionality(e.g., 2-Dimensional clusters, and so-on).

The user data may include outliers, such as outliers 212, which are userdata that are not part a cluster. In FIG. 2, data points, such as 212,falling outside the cross-hatched grid squares representing the clusters214 are considered outliers.

The process may iterate through increasingly dimensional data in thesame manner as described above. For example, plot 218 shows a3-Dimensional example of user data clusters 216 plotted against threeorthogonal axes, “CREDIT SCORE”, “DEBT”, and “INCOME.” Notably, forsimplicity, plot 218 does not show any outliers. As before, the3-Dimensional clusters 216 are stored in the cluster definitions table208.

Ultimately, the process may be repeated for each data dimension in theset of user data. Here, the process may be repeated for all fourdimensions (“AGE”, “INCOME”, “CREDIT SCORE”, and “TOTAL DEBT”) at 220before the process concludes.

FIG. 3 illustrates an embodiment of a method 300 for clustering data. At302, user data is extracted from at least one data warehouse. In someembodiments, the data warehouse may be a data repository, such as arelational database, stateless database, etc., which stores varioustypes of user data. Notably, step 302 is indicated as optional by thebroken line. In some cases, data may be present without needing toextract it from a data warehouse, such as where data is collected andstored in a volatile memory for immediate analysis, rather than beingstored offline in a non-volatile memory for later analysis.

At 304, the user data is sorted within each dimension. For example, auser's age is sorted numerically within the AGE dimension so that, at306, placement of the sorted data into appropriate bins is moreefficient (i.e., faster). Likewise the user's income is sortednumerically within the INCOME dimension for faster placement into theappropriate bins. Sorting is just one type of pre-processing of userdata stored in the data warehouse and others are possible as are knownin the art. For example, data stored within the data warehouse may benormalized before being partitioned into dimensions. Further, whilesorting is shown in step 304 as a step performed after extracting thedata from a data warehouse, in other embodiments, the data may beprocessed (e.g., sorted) by the data warehouse itself. Accordingly, step304 is indicated as optional by the broken line.

At 306, each of the data dimensions is partitioned into bins. Asdescribed above, the bins may be defined by ranges of data in eachdimension that are defined in advance or dynamically based on the set ofdata in each dimension. User data may be placed in an appropriate binbased on its value. For example, a user with an age of 37 may be placedin a bin of data dimension “AGE” that includes values between 35 and 40.

At 308, the number of users in each bin may be compared to a thresholdvalue, and each bin including a number of users greater than thethreshold value may thereafter be defined as a “cluster.” For example,if the threshold value is 10 and the bin for users with an age of 35 to40 includes 13 users, then users in that bin may be defined as acluster. Each cluster may thereafter be stored in a cluster definitionrepository, such as cluster definition table 208 in FIG. 2.

At 310, every combination of dimensions (that includes a cluster) iscompared to form clusters of higher dimension. For example, all1-Dimensional clusters may be compared and thresholds may be applied toform 2-Dimensional clusters, as described above with respect to FIG. 2.This process may be repeated to form clusters having higherdimensionalities. Clusters having relatively fewer dimensions may beconsidered to have low granularity with respect to users falling withinthose clusters while clusters having more dimensions may be consideredto have high granularity with respect to users falling within thoseclusters.

At 312, all clusters are stored in a cluster definition table, such astable 208 in FIG. 2.

A user may be associated with multiple clusters having the samedimensionality or multiple clusters having different dimensionalities.

FIG. 4 illustrates an example of an embodiment for associating a userwith one or more suitable cluster(s). At 402, a cluster definitionstable (such as table 208 in FIG. 2) is accessed by an application. At404, the clusters are searched to which clusters are associated with aparticular user. The search begins with the clusters having the highestdimensionality and proceeds through the clusters with the lowestdimensionality.

In one embodiment, the application may prune, remove, or otherwiseignore clusters from the total set of defined clusters, such as thetotal set of cluster definitions in table 208 of FIG. 2. Thereafter, theremaining clusters may be searched for association with a particularuser based on one or more criteria. For example, the criteria may relateto values or ranges of values within one or more data dimensions thatare associated with a user.

For example, search criteria may actively omit clusters associated withcertain data dimensions (e.g., TOTAL DEBT), such that clusters includingthose dimensions can be pruned prior to searching the remaining clustersfor an association with a particular user. Pruning the total set ofclusters prior to searching for clusters having an association with auser reduces the potentially relevant data set, which improves theperformance of the device processing the data (e.g., by making thesearch faster and less processor intensive).

The application may sometimes include dimensions as search criteria evenwhen those dimensions are not present in the user's data. For example,the INCOME dimension can be made part of the search even though aparticular user has not provided that data. In such cases, even though aparticular user may not be associated with INCOME data, the clustersresulting from a search that included the INCOME dimension may provideinformation about other users in those clusters to be compared to theparticular user.

At 406, a search is performed (e.g., via a structured query) todetermine whether one or more suitable cluster(s) is found, where asuitable cluster may be a cluster associated with a user. If found, thesuitable one or more suitable clusters are provided to the application.If, however, no suitable clusters are found at a particular level ofdimensionality, then at 410 another search determines whether there areany suitable clusters at a lower dimensionality left to be searched. Ifat 410, there are no clusters left to be searched, then an indication ofsuch is provided to the application.

If there are more clusters that can be searched at step 410, the processproceeds to step 412 where clusters meeting the application criteria andhaving the lower dimensionality are searched. For example, if at step406 there are no 3-dimensional clusters that are suitable, then at step410 it may be determined that there are 2-dimensional clusters to besearched. After all of the clusters in the lower dimensionality havebeen searched, the method proceeds to element 406 as described above.Elements 406, 410 and 412 form an iterative loop that searches clustersat descending levels of dimensionality. If no suitable clusters havebeen found and there are no more clusters left to search, at 414 anindication that no suitable cluster has been found is provided to theapplication.

FIG. 5 illustrates an embodiment of a method 500 for associating a userwith a cluster. At 502, a cluster definition table is searched forclusters associated with a particular user. At 504, search criteria areused to prune clusters in every dimensionality that are not relevant tothe search criteria. After pruning, any clusters that remain areavailable for a comparison at 506.

At 506, a user's characteristics are compared to the one or moreremaining clusters having the highest dimensionality. If no clusters arefound that can be associated with the user, then the method 500 proceedstowards 508. At 508, the comparison proceeds in a decremented fashion tothe clusters that remain and have progressively lower dimensionality. Ifno suitable clusters are found, then the search will continue descendingin dimensionality until one or more suitable clusters are found, oruntil there are no more clusters left to search.

Although, a user can be associated with multiple clusters, there aremethods for deciding which cluster to associate with a user. Forexample, a user may have a dimension (e.g., credit score or credit carddebt) that is below average in one cluster, but above average when in adifferent cluster. In an embodiment, a decision may be made to put theuser either cluster depending on the purpose of the search. For example,if the purpose of the search was to determine clusters where the userwas above average in one dimension, then the appropriate cluster may bechosen.

FIG. 6 illustrates an embodiment of a method 600 for heuristicallyassociating a user with a cluster. A client application 602 initiatesthe process of finding a cluster for a user and acts as an interfacebetween the client and the overall system. In various embodiments theclient application may be a web application, a mobile phone application,or a traditional application running on a device or hosted by a server,or some sort of personal finance application.

At 604, there are other processes that occur such as for example, anetwork call that comes from the client application 602 to a clientapplication 606 via other processes 604 (e.g., routing, security andauthentication that occur within a system). The clustering processdescribed above may be considered an “other process” as depicted at 604.

The client application 606 is used to transmit the user's profile data(e.g., credit score, income and zip code), clustering data, and contextdata (i.e., data that provides information indicating the user'slocation in an application process) to a Cluster Statistic Selector 626via an input interface 606. Clusters from the cluster dimension table208 are also received via the input interface 606.

A user may be associated with more than one cluster. When the user isassociated with multiple clusters heuristics 608 are applied to theclusters. For example, a heuristic may score and select a cluster basedon the number of users in that cluster. As another example, anotherheuristic may score a cluster based upon whether it has one or morestatistics that is closest to the user's profile data. For example, ifthe user has a certain credit score and the statistic is average creditscore, then the heuristic may select the cluster that has the smallestdistance between the user's credit score and the average credit score.

At 610, a determination is made whether to explore 612 when there moreinformation needed or exploit 614 when there is enough informationalready.

At 614 a decision is made regarding which heuristic to apply. At 616, anoutput interface receives the decision made at 614 and transmits thatinformation to the client application 602 via the other processes 604.

At 624 the heuristic that is the most applicable to the user (based uponuser feedback provided in 602) is selected and is used later at exploit614 transmitted towards 614 as the heuristic to use next. For example,if at 624 it is determined that the heuristic with the most users in thecluster is the most appropriate to use, then that information is used at614 for selection of that heuristic until there is an update. Forexample, when the program is first run, there is no client applicationdata. The system chooses a heuristic from a group of heuristics becauseit has to learn more (i.e., have more data). As the program is run moretimes enough data will eventually be acquired where exploit 614 isselected rather than explore 612. When there is enough data, 624instructs to select exploit 614. Thus 610 acts as a dial that determineswhat percentage exploit 614 and explore 612 are selected, and 624 tunes(adjusts the percentage) that dial based upon the information in thebusiness metrics 622.

The business metrics 622 tracks usage (also referred to herein as“beaconing”) by a usage. For example, as a user proceeds through theapplication process they leave a click stream of theirselection(s)/interactions that get stored in the business metrics 622(both in a raw form and in a derived form). In some embodiments, abusiness metric database 622 may track and receive the selected clusterand statistic as well. The business metric database 622 may be used tobuild a training process. The training process is used to update thestrategy that that was used by the heuristic. The training process drawsdata from the business metric, analyzes it, and comes up with a newstrategy or new set of strategies that will then be loaded as a file atthe run-time. In addition, 622 and 624 are off-line processes as opposedto the other processes depicted in FIG. 6 which are real-time processes.624 is a periodic process (e.g., daily or weekly) that is used to updatethe exploit 614 process.

FIG. 7 illustrates example operations 700 for heuristically selecting acluster for the user. At 702, user data, context data, and clusters forthose clusters are received. At 704, the user data is compared tocontext data, clusters and other data to determine which heuristic touse. At 706, the clusters are scored based upon some criteria. Forexample, when the user is in multiple clusters a heuristic can give thecluster with the most number of users a higher than the cluster having afewer number of users. At 708, a heuristic is selected and at 710 acluster is selected for association with the user that is closest to theselected heuristic.

FIG. 8 illustrates an example computing system 800 for forming a clusterdimensions table and for associating a user with a cluster clustering,according to embodiments of the present disclosure. As shown, the system800 includes, without limitation, a central processing unit (CPU) 804,one or more I/O device interfaces 806 which may allow for the connectionof various I/O devices 802 (e.g., keyboards, displays, mouse devices,pen input, etc.) to the system 800, network interface 814, a memory 810,storage 820, and an interconnect 818.

CPU 804 may retrieve and execute programming instructions stored in thememory 810. Similarly, the CPU 804 may retrieve and store applicationdata residing in the memory 810. The interconnect 818 transmitsprogramming instructions and application data, among the CPU 804, I/Odevice interface 806, network interface 808, memory 810, and storage820. CPU 804 is included to be representative of a single CPU, multipleCPUs, a single CPU having multiple processing cores, and the like.Additionally, the memory 810 is included to be representative of arandom access memory. Furthermore, the storage 820 may be a disk drive,solid-state drive, or a collection of storage devices distributed acrossmultiple storage systems. Although shown as a single unit, the storage820 may be a combination of fixed and/or removable storage devices, suchas fixed disc drives, removable memory cards or optical storage, networkattached storage (NAS), or a storage area-network (SAN).

As shown, memory 810 includes an application 812, which may comprise aweb service (e.g., a remotely hosted financial services application),which may execute REST requests and return REST responses. Memory 810further includes a cluster application module 816, which forms clustersfrom users' data and finds a cluster(s) to associate a single user (andis described above with respect to FIGS. 1-7). The components in memory810 may communicate with other devices over network 814 through networkinterface 808.

In one embodiment, the system utilizes a method that receives new userdata, context data, clusters and statistics for the clusters. The methodcompares the new user data to the statistics to calculate heuristics foreach of the clusters and scores the clusters based upon at least one ofthe statistics and the user data. A heuristic is selected and then acluster is selected that is closest to the selected heuristic.

In another embodiment, a system is provided that includes a processor;and a memory storing instructions, which, when executed by theprocessor, performs a method for selecting a cluster for a specificuser. The system searches a cluster definition table having clusters forat least one associated cluster in a highest dimension for associationwith a specific user. The search includes omitting clusters that do notcontain client cluster criteria and user characteristics for thespecific user, and leaving remaining clusters. The search compares usercharacteristics for the specific user to clusters that are in adimension that is equal to a cluster in a highest dimension thatcontains the user characteristics and indicating that the at least oneassociated cluster is found when user specific data is within thecluster having the highest dimensionality. The search decrements thecomparison, of the user specific data down to clusters having a nexthighest dimensionality and comparing the user specific data to clustersin the next highest dimension, wherein the decrementing is repeatedlydone until the at least one associated cluster is found.

In yet another embodiment, a computer-implemented method for processingdata includes receiving user data, context data, a group of clusters,and statistics for each cluster in the group of clusters. The methodcompares user data to the statistics to calculate heuristics for eachcluster in the group of clusters and scores clusters based upon at leastone of the statistics and the user data. A heuristic is selected and acluster is selected that is closest to the selected heuristic.

The method may further include transmitting the selected heuristic, theselected cluster and statistics for the selected cluster to a clientapplication. In one embodiment, the method also includes analyzing theselected heuristic, the selected cluster and statistics for the selectedcluster to a client application; updating a learned heuristic based uponthe analysis; and replacing the selected heuristic with the learnedheuristic.

The user data and the context data may be received from a clientapplication. The context data may provide an indication of at least oneof a user's location in an application process and an indication ofwhere the user data was inserted in the application process.

In yet another embodiment, a system includes a processor; and a memorystoring instructions, which, when executed by the processor, performs amethod for clustering user data. The system receives user data, contextdata, a group of clusters, and statistics for each cluster in the groupof clusters and compares user data to the statistics to calculateheuristics for each cluster in the group of clusters. Clusters arescored based upon at least one of the statistics and the user data. Aheuristic is selected and a cluster is selected that is closest to theselected heuristic.

The method utilized by the system may further include transmitting theselected heuristic, the selected cluster and statistics for the selectedcluster to a client application. The method may also analyze theselected heuristic, the selected cluster and statistics for the selectedcluster to a client application; update a learned heuristic based uponthe analysis; and replace the selected heuristic with the learnedheuristic. In one embodiment, the context data provides an indication ofat least one of a user's location in an application process and anindication of where the user data was inserted in the applicationprocess.

In the preceding, reference is made to embodiments presented in thisdisclosure. However, the scope of the present disclosure is not limitedto specific described embodiments. Instead, any combination of thefollowing features and elements, whether related to differentembodiments or not, is contemplated to implement and practicecontemplated embodiments. Furthermore, although embodiments disclosedherein may achieve advantages over other possible solutions or over theprior art, whether or not a particular advantage is achieved by a givenembodiment is not limiting of the scope of the present disclosure. Thus,the following aspects, features, embodiments and advantages are merelyillustrative and are not considered elements or limitations of theappended claims except where explicitly recited in a claim(s).

Aspects of the present disclosure may take the form of an entirelyhardware embodiment, an entirely software embodiment (includingfirmware, resident software, micro-code, etc.) or an embodimentcombining software and hardware aspects that may all generally bereferred to herein as a “circuit,” “module” or “system.” Furthermore,aspects of the present disclosure may take the form of a computerprogram product embodied in one or more computer readable medium(s)having computer readable program code embodied thereon.

As used herein, the terms “having,” “containing,” “including,”“comprising” and the like are open ended terms that indicate thepresence of stated elements or features, but do not preclude additionalelements or features. The articles “a,” “an,” and “the” are intended toinclude the plural as well as the singular, unless the context clearlyindicates otherwise.

While the foregoing is directed to embodiments of the presentdisclosure, other and further embodiments of the disclosure may bedevised without departing from the basic scope thereof, and the scopethereof is determined by the claims that follow.

We claim:
 1. A computer-implemented method for processing data,comprising: partitioning, into a plurality of bins, user data for eachdimension in a plurality of dimensions, wherein the plurality ofdimensions includes a maximum number of dimensions; storing clusters foreach dimension into a cluster definitions table; adding, incrementally,a number of dimensions that are combined, and identifying everycombination of clusters above a threshold, wherein a given number ofdimensions in each given combination of clusters defines adimensionality of the given combination of clusters; partitioning, intobins, each combination; defining, as clusters, bins that include theuser data that exceeds the threshold; storing the clusters in thecluster definitions table; searching the cluster definitions table forat least one associated cluster in a highest dimension for associationwith a specific user, wherein the searching comprises: omitting clustersthat do not contain client cluster criteria and user characteristics forthe specific user, and leaving remaining clusters; performing acomparison of user characteristics for the specific user to clustersthat have a highest level of dimensionality that contains the usercharacteristics and indicating that the at least one associated clusteris found when user specific data is within a remaining cluster havingthe highest dimensionality; and decrementing the comparison of the userspecific data down to a cluster having a next highest dimensionality andcomparing the user specific data to clusters having a next level ofdimensionality wherein the decrementing is repeatedly done until the atleast one associated cluster is found.
 2. The computer-implementedmethod of claim 1 wherein the bins are partitioned into a predeterminednumber of bins.
 3. The computer-implemented method of claim 1 whereinthe bins are partitioned based upon a distribution of the user data. 4.The computer-implemented method of claim 1, further comprisingextracting the user data from at least one data warehouse prior topartitioning the user data.
 5. The computer-implemented method of claim1 wherein the user data is at least one of: categorical values; ornumerical values.
 6. The computer-implemented method of claim 1, furthercomprising: receiving new user data, context data, clusters andstatistics for the clusters; comparing the new user data to thestatistics to calculate heuristics for each of the clusters; scoring theclusters based upon at least one of the statistics and the user data;selecting a heuristic; and selecting an cluster that is closest to theselected heuristic.
 7. A system, comprising: a processor; and a memorystoring instructions, which, when executed by the processor, performs amethod for clustering user data, comprising: partitioning, into aplurality of bins, user data for each dimension in a plurality ofdimensions; storing clusters for each dimension into a clusterdefinitions table; adding, incrementally, a number of dimensions thatare combined, and overlaying every combination of clusters, wherein agiven number of dimensions in each given combination defines adimensionality of the given combination; partitioning, into bins, eachcombination; defining, as overlaid clusters, bins that include the userdata that exceeds a threshold; storing the overlaid clusters in thecluster definitions table; and searching the cluster definitions tablefor at least one associated cluster in a highest dimension forassociation with a specific user, wherein the searching comprises:omitting clusters that do not contain client cluster criteria and usercharacteristics for the specific user, and leaving remaining clusters;performing a comparison of user characteristics for the specific user toclusters that have a highest level of dimensionality that contains theuser characteristics and indicating that the at least one associatedcluster is found when user specific data is within a remaining clusterhaving the highest dimensionality; and decrementing the comparison ofthe user specific data down to a cluster having a next highestdimensionality and comparing the user specific data to clusters having anext level of dimensionality wherein the decrementing is repeatedly doneuntil the at least one associated cluster is found.
 8. The system ofclaim 7, wherein the method further comprises the bins partitioned intoa predetermined number of bins.
 9. The system of claim 7, wherein themethod further comprises the bins partitioned based upon a distributionof the user data.
 10. The system of claim 7, wherein the method furthercomprises extracting the user data from at least one data warehouseprior to partitioning the user data.
 11. The system of claim 7, whereinthe user data is at least one of categorical values and numericalvalues.
 12. The system of claim 7, wherein the method further comprises:receiving new user data, context data, clusters and statistics for theclusters; comparing the new user data to the statistics to calculateheuristics for each of the clusters; scoring the clusters based upon atleast one of the statistics and the user data; selecting a heuristic;and selecting an cluster that is closest to the selected heuristic. 13.A computer-implemented method for processing data, comprising:partitioning, into a plurality of bins, user data for each dimension ina plurality of dimensions, wherein the plurality of dimensions includesa maximum number of dimensions; storing clusters for each dimension intoa cluster definitions table; adding, incrementally, a number ofdimensions that are combined, and identifying every combination ofclusters above a threshold, wherein a given number of dimensions in agiven combination defines a dimensionality of the given combination;partitioning, into bins, each combination; defining, as clusters, binsthat include the user data that exceeds the threshold; storing theclusters in the cluster definitions table; receiving new user data,context data, clusters and statistics for the clusters; comparing thenew user data to the statistics to calculate heuristics for each of theclusters; scoring the clusters based upon at least one of the statisticsand the user data; selecting a heuristic; and selecting an cluster thatis closest to the selected heuristic.
 14. The computer-implementedmethod of claim 13, wherein the bins are partitioned into apredetermined number of bins.
 15. The computer-implemented method ofclaim 13, wherein the bins are partitioned based upon a distribution ofthe user data.
 16. The computer-implemented method of claim 13, furthercomprising extracting the user data from at least one data warehouseprior to partitioning the user data.
 17. The computer-implemented methodof claim 13, wherein the user data is at least one of: categoricalvalues; or numerical values.
 18. The computer-implemented method ofclaim 13, further comprising: searching the cluster definitions tablefor at least one associated cluster in a highest dimension forassociation with a specific user, wherein the searching comprises:omitting clusters that do not contain client cluster criteria and usercharacteristics for the specific user, and leaving remaining clusters;performing a comparison of user characteristics for the specific user toclusters that have a highest level of dimensionality that contains theuser characteristics and indicating that the at least one associatedcluster is found when user specific data is within a remaining clusterhaving the highest dimensionality; and decrementing the comparison, ofthe user specific data down to a cluster having a next highestdimensionality and comparing the user specific data to clusters having anext level of dimensionality wherein the decrementing is repeatedly doneuntil the at least one associated cluster is found.